Inertia of Kraus matrices
نویسندگان
چکیده
For positive real numbers $r$, $p\_0$, and $p\_1 < \cdots p\_n,$ let $K\_r$ be the $n \times n$ Kraus matrix whose $(i,j)$ entry is equal to $$ \frac{1}{p\_i - p\_j} \Bigl( \frac{p\_i^r p\_0^r}{p\_i -p\_0} \frac{p\_j^r p\_0^r}{p\_j \Bigr). We determine inertia of this matrix.
منابع مشابه
The Inertia of Hermitian Tridiagonal Block Matrices
Let H be a partitioned tridiagonal Hermitian matrix. We characterized the possible inertias of H by a system of linear inequalities involving the orders of the blocks, the inertia of the diagonal blocks and the ranks the lower and upper subdiagonal blocks. From the main result can be derived some propositions on inertia sets of some symmetric sign pattern matrices.
متن کاملModifying the inertia of matrices arising in optimization
Applications in constrained optimization (and other areas) produce symmetric matrices with a natural block 2 2 structure. An optimality condition leads to the problem of perturbing the (1,1) block of the matrix to achieve a speci®c inertia. We derive a perturbation of minimal norm, for any unitarily invariant norm, that increases the number of nonnegative eigenvalues by a given amount, and we s...
متن کاملSome Theorems on the Inertia of General Matrices
1.1. Much is known about the distribution of the roots of algebraic equations in half-planes. (Cf. the corresponding parts in the survey [l] by Marden.) In the case of matrix equations, however, there appears to be only one known general result concerning the location of the eigenvalues of a matrix in the left half-plane. This theorem is generally known as Lyapunov’s theorem: (L,) Let A be an n...
متن کاملInertia Theorems for Matrices: the Semi-definite Case
1. The inertia of a square matrix A with complex elements is defined to be the integer triple In A = (ir(A), V(A), 8(4)), where ir(A) {v(A)} equals the number of eigenvalues in the open right {left} half plane, and 8(A) equals the number of eigenvalues on the imaginary axis. The best known classical inertia theorem is that of Sylvester : If P > 0 (positive definite) and H is Hermitian, then In ...
متن کاملWilkinson's inertia-revealing factorization and its application to sparse matrices
We propose a new inertia-revealing factorization for sparse matrices. The factorization scheme and the method for extracting the inertia from it were proposed in the 1960s for dense, banded, or tridiagonal matrices, but they have been abandoned in favor of faster methods. We show that this scheme can be applied to any sparse matrix and that the fill in the factorization is bounded by the fill i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of spectral theory
سال: 2023
ISSN: ['1664-039X', '1664-0403']
DOI: https://doi.org/10.4171/jst/431